package 字符串算法;

public class 反转字符串 {
    class Solution{
        public void resver(char[] s){
            int l = 0;
            int k = s.length-1;
            while (l>k){
                s[l] ^= s[k];
                s[k] ^= s[l];
                s[l] ^= s[k];
                l++;
                k--;
            }

        }
    }
}
